Efficient Implementation of Barrier Synchronization in Wormhole-Routed Hypercube Multicomputers
نویسندگان
چکیده
This paper addresses eecient implementation of barrier synchronization in wormhole-routed hypercube multicomputers. For those systems supporting only unicast communication in hardware, a novel software tree approach, the U-cube tree, is proposed. An important feature of the U-cube tree is that all messages injected into the network are guaranteed to be contention-free. Performance measurements of several barrier synchronization techniques implemented on a 64-node nCUBE-2 are given.
منابع مشابه
A Fault-Tolerant Deadlock-Free Multicast Algorithm for Wormhole Routed Hypercubes
In this paper, we propose a novel fault-tolerant multicast algorithm for n-dimensional wormhole routed hypercubes. The multicast algorithm will remain functional if the number of faulty nodes in an n-dimensional hypercube is less than n. Multicast is the delivery of the same message from one source node to an arbitrary number of destination nodes. Recently, wormhole routing has become one of th...
متن کاملAdaptive Wormhole Routing in Hypercube Multicomputers
In this paper, we propose a uniform adaptive routing strategy for wormhole-routed hypercube networks that accommodates both unicast and multicast communication. Based on a node labeling method, the resultant routing algorithms are shown to be deadlock-free without requiring virtual channels. The order in which the destinations are visited is important to ee-ciency. We present an ordering algori...
متن کاملFast Barrier Synchronization in Wormhole k-ary n-cube Networks with Multidestination Worms1
This paper presents a new approach to implement fast barrier synchronization in wormhole k-ary n-cubes. The novelty lies in using multidestination messages instead of the traditional single destination messages. Two diierent multidestination worm types, gather and broadcasting, are introduced to implement the report and wake-up phases of barrier synchronization , respectively. Algorithms for co...
متن کاملOptimal Phase Barrier Synchronization in K-ary N-cube Wormhole-routed Systems Using Multirendezvous Primitives
We propose a new multiphase barrier synchronization algorithm for k-ary n-cube networks using our earlier developed multirendezvous synchronization primitives 4]. The algorithm incurs minimal cost with optimal number of communication phases. The optimality is guided by system connguration parameters (k; n) and technological parameters t s (communication start-up cost) and t p (link-propagation ...
متن کاملTwo-phase Multicast in Wormhole-Switched Bidirectional Multistage Banyan Networks
A multistage interconnection network is a suitable class of interconnection architecture for constructing large-scale multicomputers. Broadcast and multicast communication are fundamental in supporting collective communication operations such as reduction and barrier synchronization. In this paper, we propose a new multicast technique in wormhole-switched bidirectional multistage banyan network...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992